On Strictly Convex and Strictly 2-Convex 2-Normed Spaces

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weighted composition operators between growth spaces on circular and strictly convex domain

Let $Omega_X$ be a bounded, circular and strictly convex domain of a Banach space $X$ and $mathcal{H}(Omega_X)$ denote the space of all holomorphic functions defined on $Omega_X$. The growth space $mathcal{A}^omega(Omega_X)$ is the space of all $finmathcal{H}(Omega_X)$ for which $$|f(x)|leqslant C omega(r_{Omega_X}(x)),quad xin Omega_X,$$ for some constant $C>0$, whenever $r_{Omega_X}$ is the M...

متن کامل

On the Mazur–Ulam theorem in fuzzy n–normed strictly convex spaces

In this paper, we generalize the Mazur–Ulam theorem in the fuzzy real n-normed strictly convex spaces. Mathematics Subject Classification. Primary 46S40; Secondary 39B52, 39B82, 26E50, 46S50.

متن کامل

Cores of convex and strictly convex games

We follow the path initiated in Shapley (1971) and study the geometry of the core of convex and strictly convex games. We define what we call face games and use them to study the combinatorial complexity of the core of a strictly convex game. Remarkably, we present a picture that summarizes our results with the aid of Pascal’s triangle. JEL classification: C71.

متن کامل

Strictly Convex Corners Scatter

We prove the absence of non-scattering energies for potentials in the plane having a corner of angle smaller than π. This extends the earlier result of Bl̊asten, Päivärinta and Sylvester who considered rectangular corners. In three dimensions, we prove a similar result for any potential with a circular conic corner whose opening angle is outside a countable subset of (0, π).

متن کامل

Minimum Strictly Convex Quadrangulations of Convex

We present a linear{time algorithm that decomposes a convex polygon conformally into a minimum number of strictly convex quadrilaterals. Moreover, we characterize the polygons that can be decomposed without additional vertices inside the polygon, and we present a linear{time algorithm for such decompositions, too. As an application , we consider the problem of constructing a minimum conformal r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematische Nachrichten

سال: 1990

ISSN: 0025-584X

DOI: 10.1002/mana.19901490111